Dynamic Reasoning without Variables Dynamic Reasoning without Variables

نویسنده

  • Jan van Eijck
چکیده

A variable free notation for dynamic logic is proposed which takes its cue from De Bruijn's variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indices refer to the depth of the binding operator in the formula. The resulting system is analysed at length and applied to a new rational reconstruction of discourse representation theory. It is argued that the present system of dynamic logic without variables provides an explicit account of anaphoric context and yields new insight into the dynamics of anaphoric linking in reasoning. A calculus for dynamic reasoning with anaphora is presented and its soundness and completeness are established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Reasoning Without Variables

A variable free notation for dynamic logic is proposed which takes its cue from De Bruijn's variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indices refer to the depth of the binding operator in the formula. The resulti...

متن کامل

An approach to hybrid probabilistic models

This paper is concerned with a development of a theory on probabilistic models, and in particular Bayesian networks, when handling continuous variables. While it is possible to deal with continuous variables without discretisation, the simplest approach is to discretise them. A fuzzy partition of continuous domains will be used, which requires an inference procedure able to deal with soft evide...

متن کامل

A Framework for Dynamic Constraint Reasoning using Procedural Constraints

Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consistency of the associated constraint problem instance. The underlying constraint problems are invariably dynamic, as higher level decisions result in variables, values, and constraints being added and removed. In real-wo...

متن کامل

A Framework for Dynamic Constraint

Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. The result is that a signiicant part of the planning problem is translated into a constraint network whose consistency determines the vali...

متن کامل

From Simple Associations to Systemic Reasoning: A Connectionist Representation of Rules, Variables and Dynamic Bindings

Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency as though these inferences are a reflex response of their cognitive apparatus. The work presented in this paper is a step toward a computational account of this remarkable reasoning ability. We describe how a connectionist system made up of simple and slow neuron-like elements can encode millio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997